Optimal Path Planning for Helical Gear Profile Inspection with Point Laser Triangulation Probes

نویسندگان

  • Kevin B. Smith
  • Yuan F. Zheng
چکیده

New commercial Point Laser Triangulation (PLT) probes enable Coordinate Measuring Machines (CMMs) to take faster, noncontact, accurate measurements. In this paper, we address how to apply this technology to inspect helical gears. Traditionally, gears are inspected with slow, costly, and dedicated machines. The proposed flexible inspection system with a fast measuring probe can significantly reduce capital equipment costs and inspection times. Integrating PLT probes on CMMs has been limited partly because of the difficulty in generating optimal inspection paths, and partly because of the highly reflective gear surfaces. Complex sensor-to-surface orientation and obstacle-avoidance requirements of these unique probes are the main cause of the difficulty. This paper presents a geometrical approach for obtaining an optimal path plan for helical gear profile inspection with PLT probes. Models for the orientation parameters and the allowable operating regions for the PLT probe are developed. A collision avoidance strategy is also presented. Although this new method was developed and demonstrated while creating an optimal path plan for inspecting helical gears, the developed models and principles can also be applied to optimal inspection plan generation for other parts. @DOI: 10.1115/1.1349718#

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Point Laser Triangulation Probe Calibration for Coordinate Metrology

Point Laser Triangulation (PLT) probes have significant advantages over traditional touch probes. These advantages include throughput and no contact force, which motivate use of PLT probes on Coordinate Measuring Machines (CMMs). This document addresses the problem of extrinsic calibration. We present a precise technique for calibrating a PLT probe to a CMM. This new method uses known informati...

متن کامل

Sampling-based Volumetric Methods for Optimal Feedback Planning

We present a sampling-based, asymptotically optimal feedback planning method for the shortest path problem among obstacles in R. Our method combines an incremental sampling-based Delaunay triangulation with the newly introduced Repairing Fast Marching Method for computing a converging sequence of control policies. The convergence rate and asymptotic computational complexity of the algorithm are...

متن کامل

CAD-based path planning for 3-D line laser scanning

The problem of path planning for 3-D line laser scanning is addressed in this article. The path under study is for a line, as opposed to a point in conventional CNC and CMM toolpath planning. While the objective of the latter case is to drive a point along a curve, that of the former case is to drive a line across a surface. To solve this problem, a path planning method is developed. First, a s...

متن کامل

Path Planning for Aircraft Fuel Tank Inspection Robot Based on Region Division

Path planning is indispensable in performing the inspection task using continuum robot in the environment like aircraft fuel tank. In order to obtain the optimal path and make it feasible for the robot traversal, a path planning strategy based on region division is put forward. The aircraft fuel tank is divided into several regions and mapped to a two-dimension plane by using dimension reductio...

متن کامل

Study of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning

Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001